/*
 * Copyright (c) 2021.版权所有高金磊
 */

package 领扣算法.A简单题.托普利茨矩阵;

public class Main {
    public boolean isToeplitzMatrix(int[][] matrix) {
        for (int i = 1; i < matrix.length; i++) {
            for (int j = 1; j < matrix[0].length; j++) {
                if (matrix[i][j] != matrix[i - 1][j - 1])
                    return false;

            }

        }
        return true;
    }
}
